CS 267 Assignment 0

نویسنده

  • Jonathan Morris
چکیده

I am a third year Ph.D. student in Applied Science & Technology. My research advisor is Graham Fleming, in the Department of Chemistry. Our group studies energy transfer and photoprotection in photosynthesis of fundamental concern for alternative energy and food production applications. I hold a B.S. in Physics and Political Science from the University of Minnesota Twin Cities, and hope to find work either in academia or industry involving applying computational tools to pressing scientific, engineering, and social problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CS 267 : Applications of Parallel Computers Assignment 0

I am a second year graduate student pursuing my PhD in Mechanical Engineering with an emphasis in Controls. My main research interests lie in the realm of Model Predictive Control (MPC), an optimization based control technique. I am particularly interested in Distributed Model Predictive Control (DMPC), which seeks to form algorithms to split up computation of the MPC solution. I have been stud...

متن کامل

Study of near-symmetric cyclodextrins by compressed sensing 2D NMR.

The compressed sensing NMR (CS-NMR) is an approach to processing of nonuniformly sampled NMR data. Its idea is to introduce minimal l(p) -norm (0 < p ≤ 1) constraint to a penalty function used in a reconstruction algorithm. Here, we demonstrate that 2D CS-NMR spectra allow the full spectral assignment of near-symmetric β-cyclodextrin derivatives (mono-modified at the C6 position). The applicati...

متن کامل

ar X iv : 0 80 6 . 32 58 v 3 [ cs . D S ] 5 S ep 2 00 8 Local Search Heuristics for the Multidimensional Assignment Problem

The Multidimensional Assignment Problem (MAP) (abbreviated sAP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. In this paper we propose several local search heuristics for MAP and select the dominating ones. The results of computational experim...

متن کامل

ar X iv : 0 80 6 . 32 58 v 4 [ cs . D S ] 2 0 O ct 2 00 8 Local Search Heuristics for the Multidimensional Assignment Problem

The Multidimensional Assignment Problem (MAP) (abbreviated sAP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. We consider several known and new MAP local search heuristics for MAP as well as their combinations. Computational experiments with t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016